Optimal Numerical Differentiation Using Three Function Evaluations
نویسندگان
چکیده
منابع مشابه
Optimal Level of Leverage using Numerical Methods
Advances in computer software and in agent-based computational finance allow the use of numerical methods in order to optimize different type of functions. In this paper we propose a numerical method in order to find the level of leverage that maximizes the geometric mean of a series of historical daily returns. One of the advantages of the use of numerical methods is that it requires less assu...
متن کاملOptimal Continguous Expression DAG Evaluations
Generating evaluations for expression DAGs with a minimal number of registers is NP{complete. We present two algorithms that generate optimal contiguous evaluation for a given DAG. The rst is a modiication of a complete search algorithm that omits redundant evaluations. The second algorithm generates only the most promising evaluations by splitting the DAG into trees with import and export node...
متن کاملConstructing Dimension-adaptive Sparse Grid Interpolants Using Parallel Function Evaluations
Dimension-adaptive sparse grid interpolation is a powerful tool to obtain surrogate functions of smooth, medium to high-dimensional objective models. In case of expensive models, the efficiency of the sparse grid algorithm is governed entirely by the time required for the function evaluations. In this paper, we first briefly analyze the inherent parallelism of the standard dimension-adaptive al...
متن کاملOn stable numerical differentiation
A new approach to the construction of finite-difference methods is presented. It is shown how the multi-point differentiators can generate regularizing algorithms with a stepsize h being a regularization parameter. The explicitly computable estimation constants are given. Also an iteratively regularized scheme for solving the numerical differentiation problem in the form of Volterra integral eq...
متن کاملGenerating Optimal Contiguous Evaluations for Expression DAGs
We consider the NP complete problem of generating contiguous evaluations for expression DAGs with a minimal number of registers We present two algorithms that generate optimal contiguous evaluation for a given DAG The rst is a modi cation of a complete search algorithm that omits the generation of redundant evaluations The second algorithm generates only the most promising evaluations by splitt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1981
ISSN: 0025-5718
DOI: 10.2307/2007508